Simple and Visual Algorithm for Factorizing Integer Numbers
نویسندگان
چکیده
An iterative algorithm for decomposing an integer composite number C into prime factors X1 and X2 is proposed in which the properties of Vieta’s theorem are used reduced quadratic equations X2+B·X·C = 0, when first approximation computation taken equal to square root C, then С, B rounded up a larger from that is, C. In this case, calculations carried out by linearly increasing approximations one.
منابع مشابه
Developing a Mixed Integer Quadratic Programing Model with Integer Numbers for Designing a Dynamic closed-loop Logistics Network
Logistics Network Design includes network configuration decisions having long-standing influences on other tactical and operational decisions. Recently, regarding environmental issues and customer awareness and global warming closed-loop supply chain network design is taken into consideration. The proposed network for the integrated forward and reverse logistics is developed by formulating a cy...
متن کاملHomoroot Integer Numbers
In this paper we first define homorooty between two integer numbers and study some of their properties. Thereafter we state some applications of the homorooty in studying and solving some Diophantine equations and systems, as an interesting and useful elementary method. Also by the homorooty, we state and prove the necessary and sufficient conditions for existence of finite solutions in a speci...
متن کاملA Simple Randomized Algorithm to Compute Harmonic Numbers and Logarithms
Given a list of N numbers, the maximum can be computed in N iterations. During these N iterations, the maximum gets updated on average as many times as the Nth harmonic number. We first use this fact to approximate the Nth harmonic number as a side effect. Further, using the fact the Nth harmonic number is equal to the natural logarithm of N plus a constant that goes to zero with N, we approxim...
متن کاملInteger Relations Among Algebraic Numbers
A vector m = (mx , ... , mn) eZ"\ {0} is called an integer relation for the real numbers a,, ... , an , if X)0,"1, = 0 holds. We present an algorithm that, when given algebraic numbers ax , ... , an and a parametere , either finds an integer relation for a,,... , an or proves that no relation of Euclidean length shorter than 1/e exists. Each algebraic number is assumed to be given by its minima...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Control systems and computers
سال: 2022
ISSN: ['2706-8145', '2706-8153']
DOI: https://doi.org/10.15407/csc.2022.02.070